package com.hbnu.array;

import java.util.Scanner;

public class DemoArray2 {
    public static void main(String[] args) {
        Scanner leaner = new Scanner(System.in);
        int[] list_in = new int[5];
        for (int i = 0; i < list_in.length; i++) {
            list_in[i] = leaner.nextInt();
        }
        //冒泡排序
        for (int i = 0; i < list_in.length-1; i++) {
            for (int j = 0; j < list_in.length-i-1; j++) {
                if(list_in[j]<list_in[j+1]){
                    int t = list_in[j+1];
                    list_in[j+1] = list_in[j];
                    list_in[j] = t;
                }
            }
        }
        //单指针快排



        for (int i = 0; i < list_in.length; i++) {
            System.out.print(list_in[i]+" ");
        }
    }



}



